A rule-centric memetic algorithm to minimize the number of tardy jobs in the job shop
نویسنده
چکیده
This paper addresses the job shop scheduling problem with minimizing the number of tardy jobs as the objective. This problem is usually treated as a job sequencing problem, and the permutation-based representation of solutions was commonly used in the existing search-based approaches. In this paper, the flaw of the permutation-based representation is discussed, and a rule-centric concept is proposed to deal with it. A memetic algorithm is then developed to realize the proposed idea by tailored genome encoding/decoding schemes and local search procedure. Two benchmark approaches, a multi-start hill climbing approach and a simulated annealing approach, are compared in the experiments. The results show that the proposed approach significantly outperforms the benchmarks.
منابع مشابه
A branch and bound algorithm to minimize the total weighted number of tardy jobs and delivery costs with late deliveries for a supply chain scheduling problem
In this paper, we study a supply chain scheduling problem that simultaneously considers production scheduling and product delivery. jobs have to be scheduled on a single machine and delivered to customers for further processing in batches. The objective is to minimize the sum of the total weighted number of tardy jobs and the delivery costs. In this paper, we present a heuristic algorithm (HA...
متن کاملUsing a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times
This paper addresses the job shop scheduling problem to minimize the number of tardy jobs, considering the sequence dependent setup time. This problem is taken as a sequencing problem, and a family of approaches with different levels of intricacy is proposed. The simplest form is a critical ratio-based dispatching rule, which leads to satisfactory solutions by taking into account the group info...
متن کاملA heuristic job-shop scheduling algorithm to minimize the total holding cost of completed and in-process products subject to no tardy jobs
Meeting due dates is the most important goal of scheduling if the due date of each job has been promised to its customer. This paper considers the job-shop scheduling problem of minimizing the total holding cost of completed and in-process products subject to no tardy jobs. A heuristic algorithm based on the shifting bottleneck procedure is proposed for solving the minimum total holding cost pr...
متن کاملJob Shop Scheduling with Lot-sizing and Batching in an Uncertain Real-world Environment
This paper proposes a novel algorithm for a real-world job shop-scheduling problem, where both lot-sizing and batching processes are considered. A fuzzy rule-based system is developed for determining lot sizes, where the input variables are workload on the shop floor, size of the job and its urgency while the output is the size of the lots. Both input and output variables are modelled as lingui...
متن کاملMinimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کامل